A cryptanalytic time-memory trade-off
نویسنده
چکیده
A&M&-A probabilistic method is presented wtdcb cryptanalyzes any N key cryptosystem in N2i3 operations with N2j3 words of memory (average vale) after a precomputatioo which requires N operations. If tke precomputation cao be performed in a reasooable time period (e.g* several years), the additional computation reqoired to recover e& key compares very favorably wltb the N operations reqdred by an exkaostive sear& and the N words of memory reqoircd by table lookup. When applied to the Data Enqption Standard (DES) osed lo block mode, it imlicatea tbat soluths should cost between $1 and $100 esck. Themethod worksinachosenplaintextattackand,itcipherbloekchainingisnotused, am also be osed in a ciphertext-only attack.
منابع مشابه
Success probability of the Hellman trade-off
Cryptanalytic time memory trade-off is a probabilistic algorithm for inverting a generic one-way function. Since its first introduction by Hellman, many variants and their analysis results have appeared. We present a new estimate for the success probability of the original Hellman trade-off, that is more accurate than the lower bound that is widely being used today.
متن کاملMaking a Faster Cryptanalytic Time-Memory Trade-Off
In 1980 Martin Hellman described a cryptanalytic time-memory trade-off which reduces the time of cryptanalysis by using precalculated data stored in memory. This technique was improved by Rivest before 1982 with the introduction of distinguished points which drastically reduces the number of memory lookups during cryptanalysis. This improved technique has been studied extensively but no new opt...
متن کاملDiscarding the Endpoints makes the Cryptanalytic Time-Memory Trade-Offs even Faster
Cryptanalytic time-memory trade-offs were introduced by Hellman in 1980 in order to perform key-recovery attacks on cryptosystems. A major advance was presented at Crypto 2003 by Oechslin, with the rainbow table variant that outperforms Hellman’s seminal work. This paper introduces the fingerprint tables, which drastically reduce the number of false alarms during the attack compared to the rain...
متن کاملA New Cryptanalytic Time/Memory/Data Trade-off Algorithm
In 1980, Hellman introduced a time/memory trade-off (TMTO) algorithm satisfying the TMTO curve TM = N, where T is the online time, M is the memory and N is the size of the search space. Later work by Biryukov-Shamir incorporated multiple data to obtain the curve TMD = N, where D is the number of data points. In this paper, we describe a new table structure obtained by combining Hellman’s struct...
متن کاملTime-Memory Trade-Offs: False Alarm Detection Using Checkpoints
Since the original publication of Martin Hellman’s cryptanalytic time-memory trade-off, a few improvements on the method have been suggested. In all these variants, the cryptanalysis time decreases with the square of the available memory. However, a large amount of work is wasted during the cryptanalysis process due to so-called “false alarms”. In this paper we present a method of detection of ...
متن کاملVariants of the Distinguished Point Method for Cryptanalytic Time Memory Trade-Offs
The time memory trade-off (TMTO) algorithm, first introduced by Hellman, is a method for quickly inverting a one-way function, using pre-computed tables. The distinguished point method (DP) is a technique that reduces the number of table lookups performed by Hellman’s algorithm. In this paper we propose a new variant of the DP technique, named variable DP (VDP), having properties very different...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 26 شماره
صفحات -
تاریخ انتشار 1980